Answer to a Question by Burr and Erdös on Restricted Addition, and Related Results

نویسندگان

  • Norbert Hegyvári
  • François Hennecart
  • Alain Plagne
چکیده

We study the gaps in the sequence of sums of h pairwise distinct elements of a given sequence A in relation with the gaps in the sequence of sums of h not necessarily distinct elements of A. We present several results on this topic. One of them gives a negative answer to a question by Burr and Erdős. 2000 Mathematics Subject Classification: 11B05, 11B13, 11P99

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hyperstability of some functional equation on restricted domain‎: direct and fixed point methods

The study of stability problems of functional equations was motivated by a question of S.M. Ulam asked in 1940. The first result giving answer to this question is due to D.H. Hyers. Subsequently, his result was extended and generalized in several ways.We prove some hyperstability results for the equation g(ax+by)+g(cx+dy)=Ag(x)+Bg(y)on restricted domain. Namely, we show, under some weak natural...

متن کامل

Investigating Embedded Question Reuse in Question Answering

The investigation presented in this paper is a novel method in question answering (QA) that enables a QA system to gain performance through reuse of information in the answer to one question to answer another related question. Our analysis shows that a pair of question in a general open domain QA can have embedding relation through their mentions of noun phrase expressions. We present methods f...

متن کامل

مقایسه دو روش آموزش حضوری و غیرحضوری بر افزایش میزان شیردهی انحصاری به مادران باردار

Introduction & Objective: There is a direct relationship between the education and exclusive breast-feeding. Most of the educational programs have given after child birth, based on " Rooming in plan”, but because of difficult situation and busy thoughts of mothers, they were not desirable way of education, therefore in this study the role of verbal & nonverbal education was evaluated on the rat...

متن کامل

On the computational complexity of finding a minimal basis for the guess and determine attack

Guess-and-determine attack is one of the general attacks on stream ciphers. It is a common cryptanalysis tool for evaluating security of stream ciphers. The effectiveness of this attack is based on the number of unknown bits which will be guessed by the attacker to break the cryptosystem. In this work, we present a relation between the minimum numbers of the guessed bits and uniquely restricted...

متن کامل

Optimizing question answering systems by Accelerated Particle Swarm Optimization (APSO)

One of the most important research areas in natural language processing is Question Answering Systems (QASs). Existing search engines, with Google at the top, have many remarkable capabilities. But there is a basic limitation (search engines do not have deduction capability), a capability which a QAS is expected to have. In this perspective, a search engine may be viewed as a semi-mechanized QA...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Combinatorics, Probability & Computing

دوره 16  شماره 

صفحات  -

تاریخ انتشار 2007